On Approximation Properties of the Independent Set Problem for Degree 3 Graphs
نویسندگان
چکیده
The main problem we consider in this paper is the Independent Set problem for bounded degree graphs. It is shown that the problem remainsMAX SNP{complete when the maximum degree is bounded by 3. Some related problems are also shown to be MAX SNP{complete at the lowest possible degree bounds. Next we study better poly{time approximation of the problem for degree 3 graphs, and improve the previously best ratio, 5 4 , to arbitrarily close to 6 5 . This result also provides improved poly{time approximation ratios, B+3 5 + , for odd degree B.
منابع مشابه
Complexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملAverage-case complexity of Maximum Weight Independent Set with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP -complete combinatorial optimization problem. Unlike other NP-complete problems, it does not admit a constant factor approximation algorithm for general graphs. Furthermore, even for graphs with largest degree 3, no polynomial time approximation algorithm exists with a 1.0071-factor approximation guarantee. We consider...
متن کاملIndependent Sets in Bounded-Degree Hypergraphs
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certa...
متن کاملImproved Approximations of Independent Dominating Set in Bounded Degree Graphs
We consider the problem of nding an independent dominating set of minimum cardinality in bounded degree and regular graphs. We rst give an approximation algorithm for at most cubic graphs, that achieves ratio 2, based on greedy and local search techniques. We then propose an heuristic based on an iterative application of the greedy technique on graphs of lower and lower degree. When the graph i...
متن کاملHardness of Approximating Problems on Cubic Graphs
Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. This means that unless P=NP these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded by three.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995